0.00/0.09	% Problem    : Vampire---4.8_5160 : TPTP v0.0.0. Released v0.0.0.
0.09/0.10	% Command    : run_E %s %d THM
0.09/0.29	% Computer : n021.cluster.edu
0.09/0.29	% Model    : x86_64 x86_64
0.09/0.29	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.29	% Memory   : 8042.1875MB
0.09/0.29	% OS       : Linux 3.10.0-693.el7.x86_64
0.09/0.29	% CPULimit   : 1440
0.09/0.29	% WCLimit    : 180
0.09/0.30	% DateTime   : Mon Jul  3 13:06:22 EDT 2023
0.09/0.30	% CPUTime    : 
0.14/0.38	Running higher-order theorem provingRunning: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160
0.14/0.38	# Version: 3.1pre001-ho
0.14/0.42	# Preprocessing class: HSSSSLSSSLMNSSA.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.42	# Starting new_ho_10 with 900s (5) cores
0.14/0.42	# Starting new_bool_2 with 180s (1) cores
0.14/0.42	# Starting new_bool_9 with 180s (1) cores
0.14/0.42	# Starting ehoh_best_sine_rwall with 180s (1) cores
0.14/0.42	# new_ho_10 with pid 5342 completed with status 0
0.14/0.42	# Result found by new_ho_10
0.14/0.42	# Preprocessing class: HSSSSLSSSLMNSSA.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.42	# Starting new_ho_10 with 900s (5) cores
0.14/0.42	# No SInE strategy applied
0.14/0.42	# Search class: HGUSF-FFSF33-SSSFMSNN
0.14/0.42	# partial match(3): HGUSF-FFSF22-SSSFMSBN
0.14/0.42	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.14/0.42	# Starting new_ho_10 with 541s (1) cores
0.14/0.42	# Starting new_bool_2 with 91s (1) cores
0.14/0.42	# Starting new_bool_9 with 91s (1) cores
0.14/0.42	# Starting ehoh_best8_lambda with 91s (1) cores
0.14/0.42	# Starting new_bool_3 with 86s (1) cores
0.14/0.42	# new_bool_2 with pid 5350 completed with status 0
0.14/0.42	# Result found by new_bool_2
0.14/0.42	# Preprocessing class: HSSSSLSSSLMNSSA.
0.14/0.42	# Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.14/0.42	# Starting new_ho_10 with 900s (5) cores
0.14/0.42	# No SInE strategy applied
0.14/0.42	# Search class: HGUSF-FFSF33-SSSFMSNN
0.14/0.42	# partial match(3): HGUSF-FFSF22-SSSFMSBN
0.14/0.42	# Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.14/0.42	# Starting new_ho_10 with 541s (1) cores
0.14/0.42	# Starting new_bool_2 with 91s (1) cores
0.14/0.42	# Preprocessing time       : 0.001 s
0.14/0.42	# Presaturation interreduction done
0.14/0.42	
0.14/0.42	# Proof found!
0.14/0.42	# SZS status Theorem
0.14/0.42	# SZS output start CNFRefutation
0.14/0.42	thf(decl_22, type, in: $i > $i > $o).
0.14/0.42	thf(decl_23, type, funcSet: $i > $i > $i).
0.14/0.42	thf(decl_24, type, ap: $i > $i > $i > $i > $i).
0.14/0.42	thf(decl_25, type, ap2p: $o).
0.14/0.42	thf(decl_26, type, lam: $i > $i > ($i > $i) > $i).
0.14/0.42	thf(decl_27, type, lam2p: $o).
0.14/0.42	thf(decl_28, type, funcext2: $o).
0.14/0.42	thf(decl_29, type, beta2: $o).
0.14/0.42	thf(decl_30, type, esk1_3: $i > $i > ($i > $i) > $i).
0.14/0.42	thf(decl_31, type, esk2_4: $i > $i > $i > $i > $i).
0.14/0.42	thf(decl_32, type, esk3_3: $i > $i > ($i > $i) > $i).
0.14/0.42	thf(decl_33, type, esk4_0: $i).
0.14/0.42	thf(decl_34, type, esk5_0: $i).
0.14/0.42	thf(decl_35, type, esk6_0: $i).
0.14/0.42	thf(lam2p, axiom, ((lam2p)<=>![X1:$i, X2:$i, X5:$i > $i]:((![X4:$i]:(((in @ X4 @ X1)=>(in @ (X5 @ X4) @ X2)))=>(in @ (lam @ X1 @ X2 @ (^[X4:$i]:(X5 @ X4))) @ (funcSet @ X1 @ X2))))), file('/export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160', lam2p)).
0.14/0.42	thf(beta2, axiom, ((beta2)<=>![X1:$i, X2:$i, X7:$i > $i]:((![X4:$i]:(((in @ X4 @ X1)=>(in @ (X7 @ X4) @ X2)))=>![X4:$i]:(((in @ X4 @ X1)=>((ap @ X1 @ X2 @ (lam @ X1 @ X2 @ (^[X8:$i]:(X7 @ X8))) @ X4)=(X7 @ X4))))))), file('/export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160', beta2)).
0.14/0.42	thf(eta2, conjecture, ((ap2p)=>(((![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ (funcSet @ X1 @ X2))=>((lam @ X1 @ X2 @ (^[X4:$i]:(ap @ X1 @ X2 @ X3 @ X4)))=(X3))))<=(beta2))<=(funcext2))<=(lam2p))), file('/export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160', eta2)).
0.14/0.42	thf(ap2p, axiom, ((ap2p)<=>![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ (funcSet @ X1 @ X2))=>![X4:$i]:(((in @ X4 @ X1)=>(in @ (ap @ X1 @ X2 @ X3 @ X4) @ X2)))))), file('/export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160', ap2p)).
0.14/0.42	thf(funcext2, axiom, ((funcext2)<=>![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ (funcSet @ X1 @ X2))=>![X6:$i]:(((in @ X6 @ (funcSet @ X1 @ X2))=>(![X4:$i]:(((in @ X4 @ X1)=>((ap @ X1 @ X2 @ X3 @ X4)=(ap @ X1 @ X2 @ X6 @ X4))))=>((X3)=(X6)))))))), file('/export/starexec/sandbox2/tmp/tmp.AmGMETCtA0/Vampire---4.8_5160', funcext2)).
0.14/0.42	thf(c_0_5, plain, ((lam2p)<=>![X1:$i, X2:$i, X5:$i > $i]:((![X4:$i]:(((in @ X4 @ X1)=>(in @ (X5 @ X4) @ X2)))=>(in @ (lam @ X1 @ X2 @ (^[Z0/* 17 */:$i]:(X5 @ Z0))) @ (funcSet @ X1 @ X2))))), inference(fof_simplification,[status(thm)],[lam2p])).
0.14/0.42	thf(c_0_6, plain, ((beta2)<=>![X1:$i, X2:$i, X7:$i > $i]:((![X4:$i]:(((in @ X4 @ X1)=>(in @ (X7 @ X4) @ X2)))=>![X4:$i]:(((in @ X4 @ X1)=>((ap @ X1 @ X2 @ (lam @ X1 @ X2 @ (^[Z0/* 17 */:$i]:(X7 @ Z0))) @ X4)=(X7 @ X4))))))), inference(fof_simplification,[status(thm)],[beta2])).
0.14/0.42	thf(c_0_7, negated_conjecture, ~((![X30:$i, X31:$i, X32:$i]:(((in @ X32 @ (funcSet @ X30 @ X31))=>![X33:$i]:(((in @ X33 @ X30)=>(in @ (ap @ X30 @ X31 @ X32 @ X33) @ X31)))))=>(![X44:$i, X45:$i, X46:$i > $i]:((![X47:$i]:(((in @ X47 @ X44)=>(in @ (X46 @ X47) @ X45)))=>(in @ (lam @ X44 @ X45 @ X46) @ (funcSet @ X44 @ X45))))=>(![X39:$i, X40:$i, X41:$i]:(((in @ X41 @ (funcSet @ X39 @ X40))=>![X42:$i]:(((in @ X42 @ (funcSet @ X39 @ X40))=>(![X43:$i]:(((in @ X43 @ X39)=>((ap @ X39 @ X40 @ X41 @ X43)=(ap @ X39 @ X40 @ X42 @ X43))))=>((X41)=(X42)))))))=>(![X34:$i, X35:$i, X36:$i > $i]:((![X37:$i]:(((in @ X37 @ X34)=>(in @ (X36 @ X37) @ X35)))=>![X38:$i]:(((in @ X38 @ X34)=>((ap @ X34 @ X35 @ (lam @ X34 @ X35 @ X36) @ X38)=(X36 @ X38))))))=>![X1:$i, X2:$i, X3:$i]:(((in @ X3 @ (funcSet @ X1 @ X2))=>((lam @ X1 @ X2 @ (ap @ X1 @ X2 @ X3))=(X3))))))))), inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[eta2])]), ap2p]), c_0_5]), funcext2]), c_0_6])])])).
0.14/0.42	thf(c_0_8, negated_conjecture, ![X48:$i, X49:$i, X50:$i, X51:$i, X52:$i, X53:$i, X54:$i > $i, X56:$i, X57:$i, X58:$i, X59:$i, X61:$i, X62:$i, X63:$i > $i, X65:$i]:(((~(in @ X50 @ (funcSet @ X48 @ X49))|(~(in @ X51 @ X48)|(in @ (ap @ X48 @ X49 @ X50 @ X51) @ X49)))&((((in @ (esk1_3 @ X52 @ X53 @ X54) @ X52)|(in @ (lam @ X52 @ X53 @ X54) @ (funcSet @ X52 @ X53)))&(~(in @ (X54 @ (esk1_3 @ X52 @ X53 @ X54)) @ X53)|(in @ (lam @ X52 @ X53 @ X54) @ (funcSet @ X52 @ X53))))&((((in @ (esk2_4 @ X56 @ X57 @ X58 @ X59) @ X56)|((X58)=(X59))|~(in @ X59 @ (funcSet @ X56 @ X57))|~(in @ X58 @ (funcSet @ X56 @ X57)))&(((ap @ X56 @ X57 @ X58 @ (esk2_4 @ X56 @ X57 @ X58 @ X59))!=(ap @ X56 @ X57 @ X59 @ (esk2_4 @ X56 @ X57 @ X58 @ X59)))|((X58)=(X59))|~(in @ X59 @ (funcSet @ X56 @ X57))|~(in @ X58 @ (funcSet @ X56 @ X57))))&((((in @ (esk3_3 @ X61 @ X62 @ X63) @ X61)|(~(in @ X65 @ X61)|((ap @ X61 @ X62 @ (lam @ X61 @ X62 @ X63) @ X65)=(X63 @ X65))))&(~(in @ (X63 @ (esk3_3 @ X61 @ X62 @ X63)) @ X62)|(~(in @ X65 @ X61)|((ap @ X61 @ X62 @ (lam @ X61 @ X62 @ X63) @ X65)=(X63 @ X65)))))&((in @ esk6_0 @ (funcSet @ esk4_0 @ esk5_0))&((lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))!=(esk6_0)))))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_7])])])])])).
0.14/0.42	thf(c_0_9, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:(((in @ (ap @ X2 @ X3 @ X1 @ X4) @ X3)|~((in @ X1 @ (funcSet @ X2 @ X3)))|~((in @ X4 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_10, negated_conjecture, ![X1:$i, X5:$i > $i, X2:$i]:(((in @ (esk1_3 @ X1 @ X2 @ X5) @ X1)|(in @ (lam @ X1 @ X2 @ X5) @ (funcSet @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_11, negated_conjecture, ![X1:$i, X5:$i > $i, X4:$i, X3:$i, X2:$i]:(((in @ (ap @ X1 @ X2 @ X3 @ (esk1_3 @ X1 @ X4 @ X5)) @ X2)|(in @ (lam @ X1 @ X4 @ X5) @ (funcSet @ X1 @ X4))|~((in @ X3 @ (funcSet @ X1 @ X2))))), inference(spm,[status(thm)],[c_0_9, c_0_10])).
0.14/0.42	thf(c_0_12, negated_conjecture, (in @ esk6_0 @ (funcSet @ esk4_0 @ esk5_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_13, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:(((in @ (esk2_4 @ X1 @ X2 @ X3 @ X4) @ X1)|((X3)=(X4))|~((in @ X4 @ (funcSet @ X1 @ X2)))|~((in @ X3 @ (funcSet @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_14, negated_conjecture, ![X1:$i, X5:$i > $i, X2:$i]:(((in @ (lam @ X1 @ X2 @ X5) @ (funcSet @ X1 @ X2))|~((in @ (X5 @ (esk1_3 @ X1 @ X2 @ X5)) @ X2)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_15, negated_conjecture, ![X5:$i > $i, X1:$i]:(((in @ (ap @ esk4_0 @ esk5_0 @ esk6_0 @ (esk1_3 @ esk4_0 @ X1 @ X5)) @ esk5_0)|(in @ (lam @ esk4_0 @ X1 @ X5) @ (funcSet @ esk4_0 @ X1)))), inference(spm,[status(thm)],[c_0_11, c_0_12])).
0.14/0.42	thf(c_0_16, negated_conjecture, ![X1:$i]:((((X1)=(esk6_0))|(in @ (esk2_4 @ esk4_0 @ esk5_0 @ X1 @ esk6_0) @ esk4_0)|~((in @ X1 @ (funcSet @ esk4_0 @ esk5_0))))), inference(spm,[status(thm)],[c_0_13, c_0_12])).
0.14/0.42	thf(c_0_17, negated_conjecture, (in @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ (funcSet @ esk4_0 @ esk5_0)), inference(spm,[status(thm)],[c_0_14, c_0_15])).
0.14/0.42	thf(c_0_18, negated_conjecture, ((lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))!=(esk6_0)), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_19, negated_conjecture, ![X5:$i > $i, X3:$i, X2:$i, X1:$i]:(((in @ (esk3_3 @ X1 @ X2 @ X5) @ X1)|((ap @ X1 @ X2 @ (lam @ X1 @ X2 @ X5) @ X3)=(X5 @ X3))|~((in @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_20, negated_conjecture, (in @ (esk2_4 @ esk4_0 @ esk5_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ esk6_0) @ esk4_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_16, c_0_17]), c_0_18])).
0.14/0.42	thf(c_0_21, negated_conjecture, ![X1:$i, X4:$i, X3:$i, X2:$i]:((((X3)=(X4))|((ap @ X1 @ X2 @ X3 @ (esk2_4 @ X1 @ X2 @ X3 @ X4))!=(ap @ X1 @ X2 @ X4 @ (esk2_4 @ X1 @ X2 @ X3 @ X4)))|~((in @ X4 @ (funcSet @ X1 @ X2)))|~((in @ X3 @ (funcSet @ X1 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_22, negated_conjecture, ![X1:$i, X5:$i > $i]:((((ap @ esk4_0 @ X1 @ (lam @ esk4_0 @ X1 @ X5) @ (esk2_4 @ esk4_0 @ esk5_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ esk6_0))=(X5 @ (esk2_4 @ esk4_0 @ esk5_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ esk6_0)))|(in @ (esk3_3 @ esk4_0 @ X1 @ X5) @ esk4_0))), inference(spm,[status(thm)],[c_0_19, c_0_20])).
0.14/0.42	thf(c_0_23, negated_conjecture, ![X1:$i]:((((X1)=(lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)))|(in @ (esk2_4 @ esk4_0 @ esk5_0 @ X1 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))) @ esk4_0)|~((in @ X1 @ (funcSet @ esk4_0 @ esk5_0))))), inference(spm,[status(thm)],[c_0_13, c_0_17])).
0.14/0.42	thf(c_0_24, negated_conjecture, (in @ (esk3_3 @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ esk4_0), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_22]), c_0_12]), c_0_17])]), c_0_18])).
0.14/0.42	thf(c_0_25, negated_conjecture, ![X5:$i > $i, X3:$i, X2:$i, X1:$i]:((((ap @ X1 @ X2 @ (lam @ X1 @ X2 @ X5) @ X3)=(X5 @ X3))|~((in @ (X5 @ (esk3_3 @ X1 @ X2 @ X5)) @ X2))|~((in @ X3 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_8])).
0.14/0.42	thf(c_0_26, negated_conjecture, (in @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))) @ esk4_0), inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_23, c_0_12]), c_0_18])).
0.14/0.42	thf(c_0_27, negated_conjecture, ![X2:$i, X1:$i]:(((in @ (ap @ esk4_0 @ X1 @ X2 @ (esk3_3 @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))) @ X1)|~((in @ X2 @ (funcSet @ esk4_0 @ X1))))), inference(spm,[status(thm)],[c_0_9, c_0_24])).
0.14/0.42	thf(c_0_28, negated_conjecture, ![X5:$i > $i, X1:$i]:((((ap @ esk4_0 @ X1 @ (lam @ esk4_0 @ X1 @ X5) @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))))=(X5 @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)))))|~((in @ (X5 @ (esk3_3 @ esk4_0 @ X1 @ X5)) @ X1)))), inference(spm,[status(thm)],[c_0_25, c_0_26])).
0.14/0.42	thf(c_0_29, negated_conjecture, (in @ (ap @ esk4_0 @ esk5_0 @ esk6_0 @ (esk3_3 @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))) @ esk5_0), inference(spm,[status(thm)],[c_0_27, c_0_12])).
0.14/0.42	thf(c_0_30, negated_conjecture, ((ap @ esk4_0 @ esk5_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0)) @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))))=(ap @ esk4_0 @ esk5_0 @ esk6_0 @ (esk2_4 @ esk4_0 @ esk5_0 @ esk6_0 @ (lam @ esk4_0 @ esk5_0 @ (ap @ esk4_0 @ esk5_0 @ esk6_0))))), inference(spm,[status(thm)],[c_0_28, c_0_29])).
0.14/0.42	thf(c_0_31, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_21, c_0_30]), c_0_17]), c_0_12])]), c_0_18]), ['proof']).
0.14/0.42	# SZS output end CNFRefutation
0.14/0.42	# Parsed axioms                        : 13
0.14/0.42	# Removed by relevancy pruning/SinE    : 0
0.14/0.42	# Initial clauses                      : 17
0.14/0.42	# Removed in clause preprocessing      : 8
0.14/0.42	# Initial clauses in saturation        : 9
0.14/0.42	# Processed clauses                    : 146
0.14/0.42	# ...of these trivial                  : 0
0.14/0.42	# ...subsumed                          : 1
0.14/0.42	# ...remaining for further processing  : 145
0.14/0.42	# Other redundant clauses eliminated   : 0
0.14/0.42	# Clauses deleted for lack of memory   : 0
0.14/0.42	# Backward-subsumed                    : 0
0.14/0.42	# Backward-rewritten                   : 2
0.14/0.42	# Generated clauses                    : 1288
0.14/0.42	# ...of the previous two non-redundant : 1279
0.14/0.42	# ...aggressively subsumed             : 0
0.14/0.42	# Contextual simplify-reflections      : 0
0.14/0.42	# Paramodulations                      : 1287
0.14/0.42	# Factorizations                       : 0
0.14/0.42	# NegExts                              : 0
0.14/0.42	# Equation resolutions                 : 1
0.14/0.42	# Total rewrite steps                  : 11
0.14/0.42	# Propositional unsat checks           : 0
0.14/0.42	#    Propositional check models        : 0
0.14/0.42	#    Propositional check unsatisfiable : 0
0.14/0.42	#    Propositional clauses             : 0
0.14/0.42	#    Propositional clauses after purity: 0
0.14/0.42	#    Propositional unsat core size     : 0
0.14/0.42	#    Propositional preprocessing time  : 0.000
0.14/0.42	#    Propositional encoding time       : 0.000
0.14/0.42	#    Propositional solver time         : 0.000
0.14/0.42	#    Success case prop preproc time    : 0.000
0.14/0.42	#    Success case prop encoding time   : 0.000
0.14/0.42	#    Success case prop solver time     : 0.000
0.14/0.42	# Current number of processed clauses  : 134
0.14/0.42	#    Positive orientable unit clauses  : 15
0.14/0.42	#    Positive unorientable unit clauses: 0
0.14/0.42	#    Negative unit clauses             : 1
0.14/0.42	#    Non-unit-clauses                  : 118
0.14/0.42	# Current number of unprocessed clauses: 1151
0.14/0.42	# ...number of literals in the above   : 3529
0.14/0.42	# Current number of archived formulas  : 0
0.14/0.42	# Current number of archived clauses   : 11
0.14/0.42	# Clause-clause subsumption calls (NU) : 1718
0.14/0.42	# Rec. Clause-clause subsumption calls : 1275
0.14/0.42	# Non-unit clause-clause subsumptions  : 1
0.14/0.42	# Unit Clause-clause subsumption calls : 272
0.14/0.42	# Rewrite failures with RHS unbound    : 0
0.14/0.42	# BW rewrite match attempts            : 202
0.14/0.42	# BW rewrite match successes           : 2
0.14/0.42	# Condensation attempts                : 0
0.14/0.42	# Condensation successes               : 0
0.14/0.42	# Termbank termtop insertions          : 112064
0.14/0.42	
0.14/0.42	# -------------------------------------------------
0.14/0.42	# User time                : 0.036 s
0.14/0.42	# System time              : 0.003 s
0.14/0.42	# Total time               : 0.039 s
0.14/0.42	# Maximum resident set size: 1928 pages
0.14/0.42	
0.14/0.42	# -------------------------------------------------
0.14/0.42	# User time                : 0.174 s
0.14/0.42	# System time              : 0.011 s
0.14/0.42	# Total time               : 0.186 s
0.14/0.42	# Maximum resident set size: 1736 pages
0.14/0.42	% E---3.1 exiting
0.14/0.44	EOF